Parallel solution of large sparse eigenproblems using a Block-Jacobi-Davidson method Parallele Lösung großer dünnbesetzter Eigenwertprobleme mit einem Block-Jacobi-Davidson Verfahren Masterarbeit
نویسندگان
چکیده
This thesis deals with the computation of a small set of exterior eigenvalues of a given large sparse matrix on present (and future) supercomputers using a Block-JacobiDavidson method. The main idea of the method is to operate on blocks of vectors and to combine several sparse matrix-vector multiplications with different vectors in a single computation. Block vector calculations and in particular sparse matrix-multiple-vector multiplications can be considerably faster than single vector operations if a suitable memory layout is used for the block vectors. The performance of block vector computations is analyzed on the node-level as well as for a cluster of nodes. The implementation of the method is based on an existing sparse linear algebra framework and exploits several layers of parallelism. Numerical tests show that the block method developed works well for a wide range of matrices and that a small block size can speed up the complete computation of a set of eigenvalues significantly in comparison to a single vector calculation.
منابع مشابه
Computational experience with sequential and parallel, preconditioned Jacobi–Davidson for large, sparse symmetric matrices
The Jacobi–Davidson (JD) algorithm was recently proposed for evaluating a number of the eigenvalues of a matrix. JD goes beyond pure Krylov-space techniques; it cleverly expands its search space, by solving the so-called correction equation, thus in principle providing a more powerful method. Preconditioning the Jacobi–Davidson correction equation is mandatory when large, sparse matrices are an...
متن کاملA Parallel, Block, Jacobi-Davidson Implementation for Solving Large Eigenproblems on Coarse Grain Environment
Iterative methods often provide the only means of solving large eigenvalue problems. Their block variants converge slowly but they are robust especially in the presence of multiplicities. Precon-ditioning is often used to improve convergence. Yet, for large matrices, the demands posed on the available computing resources are huge. Clusters of workstations and SMPs are becoming the main computat...
متن کاملPerformance of Block Jacobi-Davidson Eigensolvers
Jacobi-Davidson methods can efficiently compute a few eigenpairs of a large sparse matrix. Block variants of JacobiDavidson are known to be more robust than the standard algorithm, but they are usually avoided as the total number of floating point operations increases. We present the implementation of a block Jacobi-Davidson solver and show by detailed performance engineering and numerical expe...
متن کاملParallel eigenanalysis of multiaquifer systems
Finite element discretizations of flow problems involving multiaquifer systems deliver large, sparse, unstructured matrices, whose partial eigenanalysis is important for both solving the flow problem and analysing its main characteristics. We studied and implemented an effective preconditioning of the Jacobi–Davidson algorithm by FSAI-type preconditioners. We developed efficient parallelization...
متن کاملIncreasing the Performance of the Jacobi-Davidson Method by Blocking
Block variants of the Jacobi-Davidson method for computing a few eigenpairs of a large sparse matrix are known to improve the robustness of the standard algorithm when it comes to computing multiple or clustered eigenvalues. In practice, however, they are typically avoided because the total number of matrix-vector operations increases. In this paper we present the implementation of a block Jaco...
متن کامل